Steiner loops satisfying Moufang's theorem

نویسندگان

  • Charles J. Colbourn
  • Maria De Lourdes Merlini Giuliani
  • Alexander Rosa
  • Izabella Stuhl
چکیده

A loop satisfies Moufang’s theorem whenever the subloop generated by three associating elements is a group. Moufang loops (loops that satisfy the Moufang identities) satisfy Moufang’s theorem, but it is possible for a loop that is not Moufang to nevertheless satisfy Moufang’s theorem. Steiner loops that are not Moufang loops are known to arise from Steiner triple systems in which some triangle does not generate a subsystem of order 7, while Steiner loops that do not satisfy Moufang’s theorem are shown to arise from Steiner triple systems in which some quadrilateral ∗ Also at University of Debrecen, H-4010 Debrecen, Hungary. C.J. COLBOURN ET AL. /AUSTRALAS. J. COMBIN. 63 (1) (2015), 170–181 171 (Pasch configuration) does not generate a subsystem of order 7. Consequently, the spectra of values of v for which a Steiner loop exists are determined when the loop is also Moufang; when the loop is not Moufang yet satisfies Moufang’s theorem; and when the loop does not satisfy Moufang’s theorem. Furthermore, examples are given of non-commutative loops that satisfy Moufang’s theorem yet are not Moufang loops.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pseudo-automorphisms and Moufang Loops

An extensive study of Moufang loops is given in [2].1 One defect of that study is that it assumes Moufang's associativity theorem [6], the only published proof of which involves a complicated induction. Using pseudo-automorphisms along with recent methods of Kleinfeld and the author [S], we shall give simple noninductive proofs of three associativity theorems, one of which (Theorem 5.1) general...

متن کامل

C-loops: an Introduction

C-loops are loops satisfying x(y(yz)) = ((xy)y)z. They often behave analogously to Moufang loops and they are closely related to Steiner triple systems and combinatorics. We initiate the study of C-loops by proving: (i) Steiner loops are C-loops, (ii) C-loops are alternative, inverse property loops with squares in the nucleus, (iii) the nucleus of a C-loop is a normal subgroup, (iv) C-loops mod...

متن کامل

Primary Decompositions in Varieties of Commutative Diassociative Loops

The decomposition theorem for torsion abelian groups holds analogously for torsion commutative diassociative loops. With this theorem in mind, we investigate commutative diassociative loops satisfying the additional condition (trivially satisfied in the abelian group case) that all nth powers are central, for a fixed n. For n = 2, we get precisely commutative C loops. For n = 3, a prominent var...

متن کامل

C-loops: Extensions and Constructions

C-loops are loops satisfying the identity x(y · yz) = (xy · y)z. We develop the theory of extensions of C-loops, and characterize all nuclear extensions provided the nucleus is an abelian group. C-loops with central squares have very transparent extensions; they can be built from small blocks arising from the underlying Steiner triple system. Using these extensions, we decide for which abelian ...

متن کامل

A Construction for Infinite Families of Steiner 3-Designs

Let q be a prime power and a be a positive integer such that a 2. Assume that there is a Steiner 3-(a+1, q+1, 1) design. For every v satisfying certain arithmetic conditions we can construct a Steiner 3-(va+1, q+1, 1) design for every d sufficiently large. In the case of block size 6, when q=5, this theorem yields new infinite families of Steiner 3-designs: if v is a given positive integer sati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 63  شماره 

صفحات  -

تاریخ انتشار 2015